Optimal Tree Contraction in the EREW Model
نویسندگان
چکیده
A deterministic parallel algorithm for parallel tree contraction is presented in this paper. The algorithm takes T time and uses (P processors, where n the number of vertices in a tree using an Exclusive Read and Exclusive Write (EREW) Parallel Random Access Machine (PRAM). This algorithm improves the results of Miller and who use the CRCW randomized PRAM model to get the same complexity and processor count. The algorithm is optimal in the sense that the product P is equal to the input size and gives an time algorithm when log Since the algorithm requires space, which is the input size, it is optimal in space as well. Techniques for prudent parallel tree contraction are also discussed, as well as implementation techniques for connection machines. work was supported in by National Science Foundation grant DCR-8514961. University of SouthernCalifornia, Angeles, CA
منابع مشابه
A note on parallel algorithms for optimal h-v drawings of binary trees
In this paper we present a method to obtain optimal h-v drawings in parallel. Based on parallel tree contraction, our method computes optimal (with respect to a class of cost functions of the enclosing rectangle) drawings in O(log n) parallel time by using a polynomial number of EREW processors. The number of processors reduces substantially when we study minimum area drawings. Our work places ...
متن کاملOptimal Algorithms for the Vertex Updating Problem of a Minimum Spanning Tree
The vertex updating problem for a minimum spanning tree (MST) is deened as follows: Given a graph G = (V; E G) and its MST T, update T when a new vertex z is introduced along with weighted edges that connect z with the vertices of G. We present a set of rules that, together with a valid tree-contraction schedule , are used to produce simple optimal parallel algorithms that run in O(lgn) paralle...
متن کاملParallel h - v Drawings of Binary Trees ? Panagiotis
In this paper we present a method to obtain optimal h-v and inclusion drawings in parallel. Based on parallel tree contraction, our method computes optimal (with respect to a class of cost functions of the enclosing rectangle) drawings in O(log 2 n) parallel time by using a polynomial number of EREW processors. The method can be extended to compute optimal inclusion layouts in the case where ea...
متن کاملAn Optimal EREW PRAM Algorithm For Minimum Spanning Tree Veri cation
We present a deterministic parallel algorithm on the EREW PRAM model to verify a minimum spanning tree of a graph. The algorithm runs on a graph with n vertices and m edges in O(logn) time and O(m+ n) work. The algorithm is a parallelization of King's linear time sequential algorithm for the problem.
متن کاملAn Optimal EREW PRAM Algorithm for Minimum Spanning Tree Verification
We present a deterministic parallel algorithm on the EREW PRAM model to verify a minimum spanning tree of a graph. The algorithm runs on a graph with n vertices and m edges in O(log n) time and O(m + n) work. The algorithm is a parallelization of King's linear time sequential algorithm for the problem.
متن کامل